Strong matching preclusion for k-ary n-cubes

نویسندگان

Shiying Wang

Kai Feng

Guozhen Zhang

چکیده

The k-ary n-cube is one of the most popular interconnection networks for parallel and distributed systems. Strong matching preclusion that additionally permits more destructive vertex faults in a graph is amore extensive formof the originalmatching preclusion that assumes only edge faults. In this paper, we establish the strong matching preclusion number and all minimum strong matching preclusion sets for k-ary n-cubes with n ≥ 2 and k ≥ 3. © 2013 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong matching preclusion of (n, k)-star graphs

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The generalized (n, k)-star graph was introduced to address scaling issues of the star graph, and it has many de...

متن کامل

Matching preclusion for vertex-transitive networks

In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let G be a graph of even order. The matching preclusion number mp(G) is defined as the minimum number of edges whose deletion results in a subgraph without perfect matchings. Many interconnection networks are super matched, that is, their optimal matching preclusion sets are precisely those...

متن کامل

Strong matching preclusion for torus networks

a r t i c l e i n f o a b s t r a c t The torus network is one of the most popular interconnection network topologies for massively parallel computing systems. Strong matching preclusion that additionally permits more destructive vertex faults in a graph is a more extensive form of the original matching preclusion that assumes only edge faults. In this paper, we establish the strong matching pr...

متن کامل

Matching preclusion and Conditional Matching preclusion for Crossed Cubes

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those inci...

متن کامل